Towards faster real algebraic numbers

On approximation of real numbers by real algebraic numbers

Questions about algebraic properties of real numbers

This paper is a survey of natural questions (with few answers) arising when one wants to study algebraic properties of real numbers, i.e., properties of real numbers w.r.t. {+, −, ×, >, ≥} in a constructive setting. Introduction This paper is a survey of natural questions (with few answers) arising when one wants to study algebraic properties of real numbers, i.e., properties of real numbers w....

Real Algebraic Numbers: Complexity Analysis and Experimentation

We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size ≤ τ , using Sturm (-Habicht) sequences and the Bernstein subdivision solver. In particular, we unify and simplify the analysis of both methods and we give an asymptotic complexity bound of e OB(d τ). This matches the best known bounds fo...

Comparing Real Algebraic Numbers of Small Degree

We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geometry efficiently and exactly. We show a new method to compare real algebraic numbers by precomputing generalized Sturm sequences, thus avoiding iterative methods; the method, moreover handles all degenerate cases. Our f...

Construction of Real Algebraic Numbers in Coq

This paper shows a construction in Coq of the set of real algebraic numbers, together with a formal proof that this set has a structure of discrete Archimedean real closed field. This construction hence implements an interface of real closed field. Instances of such an interface immediately enjoy quantifier elimination thanks to a previous work. This work also intends to be a basis for the cons...